Calculation of delay characteristics for multiserver queues with constant service times
نویسندگان
چکیده
We consider a discrete-time infinite-capacity queueing system with a general uncorrelated arrival process, constant-length service times of multiple slots, multiple servers and a first-come-first-served queueing discipline. Under the assumption that the queueing system can reach a steady state, we first establish a relationship between the steady-state probability distributions of the system content and the customer delay. Next, by means of this relationship, an explicit expression for the probability generating function of the customer delay is obtained from the known generating function of the system content, derived in previous work. In addition, several characteristics of the customer delay, namely the mean value, the variance and the tail distribution of the delay, are derived through some mathematical manipulations. The analysis is illustrated by means of some numerical examples. Editor: Artalejo
منابع مشابه
Relationship between Delay and System Contents in Multiserver Queues with Geometric Service Times
In this paper, we consider a discrete-time multiserver queueing system with infinite buffer size, geometric service times and a FCFS (first-come-first-served) queueing discipline. A relationship between the probability distributions of the system contents and the packet delay is established. The relationship is general in the sense that it doesn’t require knowledge of the exact nature of the ar...
متن کاملAnalysis of Discrete-time Multiserver Queues with Constant Service times and Correlated Arrivals
We investigate the behavior of a discrete-time multiserver buffer system with infinite buffer size. Packets arrive at the system according to a two-state correlated arrival process. The service times of the packets are assumed to be constant, equal to multiple slots. The behavior of the system is analyzed by means of an analytical technique based on probability generating functions (pgf’s). Exp...
متن کاملFurther delay moment results for FIFO multiserver queues
Using a new family of service disciplines, we provide weaker su cient conditions for nite stationary delay moments in FIFO multiserver queues. This extends the work in Sigman and Scheller-Wolf[1997] to GI=GI=s queues with = E[S]=E[T ] < s 1, where S and T are generic service and interarrival times, respectively. Thus, only when > s 1 are the familiar Kie er and Wolfowitz conditions actually nec...
متن کاملDiscrete-time multiserver queues with geometric service times
In this paper, a discrete-time multiserver queueing system with in4nite bu5er size and general independent arrivals is considered. The service times of packets are assumed to be independent and identically distributed according to a geometric distribution. Each packet gets service from only one server. In the paper, the behavior of the queueing system is studied analytically by means of a gener...
متن کاملThe Pointwise Stationary Approximation for Queues with Nonstationary Arrivals*
We empirically explore the, accuracy of an easily computed approximation for long run, average performance measures such as expected delay and probability of delay in multiserver queueing systems with exponential service times and periodic (sinusoidal) Poisson arrival processes. The pointwise stationary approximation is computed by integrating over time (that is taking the expectation of) the f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- European Journal of Operational Research
دوره 199 شماره
صفحات -
تاریخ انتشار 2009